Optimization of Project Scheduling Activities in Dynamic CPM and PERT Networks Using Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Multi-Project Scheduling using Competent Genetic Algorithms
m Number of projects n Total number of activities n h Number of activities in project h h Index of Project V z Set of activities {a(1)…a(n h)} in project h d i Processing time for activity i i→j Predecessor relationship Pred(i) Set of predecessors for activity i k R Set of renewable resources of type k ihk r Per period usage of activity i of resource k in project h K h Number of types of resour...
متن کاملExpected Duration of Dynamic Markov PERT Networks
Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...
متن کاملUsing Genetic Algorithms for Dynamic Scheduling
In most practical environments, scheduling is an ongoing reactive process where the presence of real time information continually forces reconsideration and revision of pre-established schedules. Scheduling algorithms that achieve good or near optimal solutions and can efficiently adapt them to perturbations are, in most cases, preferable to those that achieve optimal ones but that cannot imple...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملDepot shunting scheduling using combined genetic algorithm and PERT
Shunting scheduling problems at railway depot can be regarded as a sort of resource constrained project scheduling problem (RCPSP). Unlike the normal RCPSPs, however, shunting scheduling problems require that the number of activities which form a project has to be dynamically changed in the problem solving process and some of the activities have to be performed at a prescribed timing, for examp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi
سال: 2018
ISSN: 1308-6529
DOI: 10.19113/sdufbed.35437